Application of Two Nearest Neighbor Approaches to a Rich Vehicle Routing Problem
نویسنده
چکیده
In recent years, rich vehicle routing problems have been considered with particular attention by many researchers. In this paper a specific case is analyzed, which includes multiple time windows constraints and heterogeneous fleet of vehicles. A measure of difficulty of the instances is proposed and some elements that have an impact on it are analyzed. Furthermore, two heuristic algorithms are proposed, based on the well known nearest neighbor heuristic procedure. Computational experiments are performed on instances with different size and different level of difficulty. The results obtained are quite encouraging.
منابع مشابه
Supply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches
This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملThe Development of A Web-Based System in Solving the Multi-Depot Vehicle Routing problem of Fixed-Route Trucking Carriers
This research addresses an empirical multi-depot vehicle routing case for a fixed-route trucking carrier. In this case, the characteristics of vehicle routing problems, including multi-depots, dispatching quantity, routes arrangement and time-window constraints, are considered in order to reduce the delivering cost. A hybrid heuristic algorithm is developed in order to solve this practical prob...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملVehicle Routing Problem: Meta-heuristic Approaches
The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...
متن کامل